# Author    :Dun_Hz
# Time      :2024/3/13 21:22
# 斐波那契数列
fib_list = {}       # 字典
def Func(n):
    if n<2:
        return n
    if n not in fib_list:       #储存，减少后续运算次数
        fib_list[n] = Func(n-1)+Func(n-2)
    return fib_list[n]
for i in range(1,100):

    print(Func(i),end = ' ')
